Extensional Semantics for Higher-Order Logic Programs with Negation
نویسندگان
چکیده
We develop an extensional semantics for higher-order logic programs with negation, generalizing the technique that was introduced in [2, 3] for positive higher-order programs. In this way we provide an alternative extensional semantics for higher-order logic programs with negation to the one proposed in [6]. As an immediate useful consequence of our developments, we define for the language we consider the notions of stratification and local stratification, which generalize the familiar such notions from classical logic programming. We demonstrate that for stratified and locally stratified higher-order logic programs, the proposed semantics never assigns the unknown truth value. We conclude the paper by providing a negative result: we demonstrate that the well-known stable model semantics of classical logic programming, if extended according to the technique of [2, 3] to higher-order logic programs, does not in general lead to extensional stable models.
منابع مشابه
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
Extensional higher-order logic programming has been introduced as a generalization of classical logic programming. An important characteristic of this paradigm is that it preserves all the well-known properties of traditional logic programming. In this paper we consider the semantics of negation in the context of the new paradigm. Using some recent results from non-monotonic fixed-point theory,...
متن کاملThe intricacies of three-valued extensional semantics for higher-order logic programs
In (Bezem 1999; Bezem 2001), M. Bezem defined an extensional semantics for positive higherorder logic programs. Recently, it was demonstrated in (Rondogiannis and Symeonidou 2016) that Bezem’s technique can be extended to higher-order logic programs with negation, retaining its extensional properties, provided that it is interpreted under a logic with an infinite number of truth values. In (Ron...
متن کاملProof Procedures for Extensional Higher-Order Logic Programming
We consider an extensional higher-order logic programming language which possesses the minimum Herbrand model property. We propose an SLD-resolution proof procedure and we demonstrate that it is sound and complete with respect to this semantics. In this way, we extend the familiar proof theory of first-order logic programming to apply to the more general higher-order case. We then enhance our s...
متن کاملConstructive Negation in Extensional Higher-Order Logic Programming
Extensional higher-order logic programming has been recently proposed as an interesting extension of classical logic programming. An important characteristic of the new paradigm is that it preserves all the well-known properties of traditional logic programming. In this paper we enhance extensional higher-order logic programming with constructive negation. We argue that the main ideas underlyin...
متن کاملExtensional Higher-Order Datalog
We define a higher-order extension of Datalog based on the Horn fragment of higher-order logic introduced in [Wad91]. Programs of Higher-Order Datalog can be understood declaratively as formulas in extensional higher-order logic, in which (for example) a unary predicate of unary predicates is a set of sets of data objects. The language retains all the basic principles of first-order logic progr...
متن کامل